منابع مشابه
A Three-String Approach to the Closest String Problem
Article history: Received 18 May 2010 Received in revised form 11 January 2011 Accepted 21 January 2011 Available online 28 January 2011
متن کاملThe String Barcoding Problem
In this paper we consider an approach to solve the string barcoding problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.
متن کاملThe Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrences can provide search heuristics that provide several orders of magnitude speedup at and above the optimal distance. We also report (to our knowledge) the first analysis and evaluation – using any tec...
متن کاملA New Problem in String Searching
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timestamp algorithms which skip searching parts of the text where there are no matches at all and prove their correctness. At the match level, we consider Harrison signature, Karp-Rabin fingerprint, Bloom filter and automat...
متن کاملA promiseBQP-complete string rewriting problem
We consider the following combinatorial problem. We are given three strings s, t, and t of length L over some fixed finite alphabet and an integer m that is polylogarithmic in L. We have a symmetric relation on substrings of constant length that specifies which substrings are allowed to be replaced with each other. Let ∆(n) denote the difference between the numbers of possibilities to obtain t ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1963
ISSN: 0022-247X
DOI: 10.1016/0022-247x(63)90015-5